Extensions to Generic Automated Marking Environment: Game-2+
نویسندگان
چکیده
منابع مشابه
An Enhanced Generic Automated Marking Environment: GAME-2
In this paper we describe an extension of the Generic Automated Marking Environment (GAME-2) and provide an analysis of its performance in assessing student programming projects. GAME-2 has been designed to automatically assess programming exercises written in C, C++ and JAVA languages based on a number of factors including meaningful comments, the structure of functions and the detection and c...
متن کاملAn Enhanced Generic Automated Marking Environment: GAME-2
This paper describes an extension of the Generic Automated Marking Environment (GAME-2) and provides an analysis of its performance in assessing student programming projects. GAME-2 has been designed to automatically assess programming exercises written in C, C++ and JAVA languages based on a number of factors including meaningful comments, the structure of functions and the detection and corre...
متن کاملPerformance analysis of GAME: A generic automated marking environment
This paper describes the Generic Automated Marking Environment (GAME) and provides a detailed analysis of its performance in assessing student programming projects and exercises. GAME has been designed to automatically assess programming assignments written in a variety of languages based on the ‘‘structure’’ of the source code and the correctness of the program’s output. Currently, the system ...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملEfficient Computation of Semivalues for Game-Theoretic Network Centrality
Solution concepts from cooperative game theory, such as the Shapley value or the Banzhaf index, have recently been advocated as interesting extensions of standard measures of node centrality in networks. While this direction of research is promising, the computation of game-theoretic centrality can be challenging. In an attempt to address the computational issues of game-theoretic network centr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017